#include<iostream>
#include<vector>
#include<queue>
using namespace std;

class heap
{
public:
    void init_heap(vector<int>&nums,int size)
    {
        times_.resize(size);
        for(int i=0;i<nums.size();i++)
        {
            times_
        }
        //向下调整

    }

private:
    vector<pair<int,int>> times_;
};

int main()
{
    priority_queue<,>
}